Straubing An automaton model for forest algebras
نویسندگان
چکیده
2 Automata over forests 4 2.1 Forest automata . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Bottom-up deterministic forest automata . . . . . . . . . . 5 2.3 Minimization of BUDFA . . . . . . . . . . . . . . . . . . . 8 2.4 BUNFA and determinization . . . . . . . . . . . . . . . . . 14 2.5 Computing the syntactic forest algebra of a language . . . 16 2.6 Logical characterization . . . . . . . . . . . . . . . . . . . 18 2.7 Comparison with existing automaton models . . . . . . . . 20
منابع مشابه
New applications of the wreath product of forest algebras
We give several new applications of the wreath product of forest algebras to the study of logics on trees. These include new simplified proofs of necessary conditions for definability in CTL and first-order logic with the ancestor relation; a sequence of identities satisfied by all forest languages definable in PDL; and new examples of languages outsideCTL, along with an application to the ques...
متن کاملBCK-ALGEBRAS AND HYPER BCK-ALGEBRAS INDUCED BY A DETERMINISTIC FINITE AUTOMATON
In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...
متن کاملEF+EX Forest Algebras
We examine languages of unranked forests definable using the temporal operators EF and EX. We characterize the languages definable in this logic, and various fragments thereof, using the syntactic forest algebras introduced by Bojanczyk and Walukiewicz. Our algebraic characterizations yield efficient algorithms for deciding when a given language of forests is definable in this logic. The proofs...
متن کاملForest Categories
A growing body of research into the expressive power of logics on trees has employed algebraic methods—especially the syntactic forest algebra, a generalization of the syntactic monoid of regular languages. Here we enlarge the mathematical foundations of this study by extending Tilson’s theory of the algebra of finite categories, and in particular, the Derived Category Theorem, to the setting o...
متن کاملStructural properties of trees and expressivity of logical formalisms
Logics for specifying properties of labeled trees play an important role in several areas of Computer Science. Recently, attention has turned to logics for unranked trees, in which there is no a priori bound on the number of children a node may have. Barceló and Libkin [1] and Libkin [12] catalogue a number of such logics and contrast their expressive power. Many fundamental problems in this do...
متن کامل